Supervised Learning for Link Prediction in Weighted Networks
نویسندگان
چکیده
Link prediction is an important task in Social Network Analysis. This problem refers to predicting the emergence of future relationships between nodes in a social network. Our work focuses on a supervised machine learning approach for link prediction. Here, the target attribute is a class label indicating the existence or absence of a link between a node pair. The predictor attributes are metrics computed from the network structure, describing the given pair. The majority of works for supervised prediction only considers unweighted networks. In this light, our aim is to investigate the relevance of using weights to improve supervised link prediction. Link weights express the ‘strength’ of relationships and could bring useful information for prediction. However, the relevance of weights for unsupervised approaches of link prediction was not always verified (in some cases, the performance was even harmed). Our preliminary results on supervised prediction on a co-authorship network revealed satisfactory results when weights were considered, which encourage us for further analysis.
منابع مشابه
A Link Prediction Method Based on Learning Automata in Social Networks
Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...
متن کاملSemi-supervised Graph Embedding Approach to Dynamic Link Prediction
We propose a simple discrete time semi–supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross–sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past dynamics and the unsupervised loss of predicting the neighborhood context in...
متن کاملLink Prediction in Heterogeneous Collaboration Networks
Traditional link prediction techniques primarily focus on the effect of potential linkages on the local network neighborhood or the paths between nodes. In this article, we study both supervised and unsupervised link prediction in networks where instances can simultaneously belong to multiple communities, engendering different types of collaborations. Links in these networks arise from heteroge...
متن کاملFuture link regression using supervised learning on graph topology
Link prediction provides useful information for a variety of graph models, including communication, biochemical, and social networks. The goal of link prediction is usually to predict novel interactions (modeled as links/edges) between previously unconnected nodes in a graph. Link prediction is used on social networks to suggest future friends and in protein networks to suggest possible undisco...
متن کاملSemi-supervised Penalized Output Kernel Regression for Link Prediction
Link prediction is addressed as an output kernel learning task through semi-supervised Output Kernel Regression. Working in the framework of RKHS theory with vectorvalued functions, we establish a new representer theorem devoted to semi-supervised least square regression. We then apply it to get a new model (POKR: Penalized Output Kernel Regression) and show its relevance using numerical experi...
متن کامل